Intersection Graphs of Rays and Grounded Segments
نویسندگان
چکیده
منابع مشابه
Intersection Graphs of Rays and Grounded Segments
We consider several classes of intersection graphs of line segments in the plane and prove new equality and separation results between those classes. In particular, we show that: • intersection graphs of grounded segments and intersection graphs of downward rays form the same graph class, • not every intersection graph of rays is an intersection graph of downward rays, and • not every intersect...
متن کاملIntersection Graphs of L-Shapes and Segments in the Plane
An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: L, L , Land L . A k-bend path is a simple path in the plane, whose direction changes k times from horizontal to vertical. If a graph admits an intersection representation in which every vertex is represented by an L, an L or L , a k-bend path, or a segment, then this graph is cal...
متن کاملIntersection graphs of segments and $\exists\mathbb{R}$
A graph G with vertex set {v1, v2, . . . , vn} is an intersection graph of segments if there are segments s1, . . . , sn in the plane such that si and sj have a common point if and only if {vi, vj} is an edge of G. In this expository paper, we consider the algorithmic problem of testing whether a given abstract graph is an intersection graph of segments. It turned out that this problem is compl...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2018
ISSN: 1526-1719
DOI: 10.7155/jgaa.00470